Implementation of Denotational Definitions

ثبت نشده
چکیده

syntax tree semantic definition encoder generator encoder written in DSL

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Interpreter prototypes from formal language definitions

Denotational semantics is now used widely for the formal definition of programming languages but there is a lack of appropriate tools to support language development. General purpose language implementation systems are oriented to syntax with poor support for semantics. Specialised denotational semantics based systems correspond closely to the formalism but are rendered inflexible for language ...

متن کامل

A Methodology for the Definition of Programming Languages

The formal definition of a programming language is a valuable tool for the study, design, evaluation and even for the implementation of the language. A methodology for developing formal definitions of programming languages is proposed in this paper. We follow the denotational approach and use monads, in order to improve the modularity and elegance of the result. The definition of semantics is d...

متن کامل

Disentangling Denotational Semantics Definitions

Denotational semantics is a powerful technique to formally define programming languages. However, language constructs are not always orthogonal, so many semantic equations in a definition may have to be aware of unrelated constructs semantics. Current approaches for modularity in this formalism do not address this problem, providing, for this reason, tangled semantic definitions. This paper pro...

متن کامل

State-transition machines, revisited

In the autumn of 1978, Neil Jones and Steve Muchnick, working at the University of Kansas, were studying compiler synthesis from Scott-Strachey denotational-semantics definitions; I was Neil’s student. Neil read intently John Reynolds’s 1972 paper, Definitional Interpreters for Higher-Order Programming Languages [14], and applied Reynolds’s continuation-passing and defunctionalization transform...

متن کامل

The rewriting logic semantics project

Rewriting logic is a flexible and expressive logical framework that unifies algebraic denotational semantics and structural operational semantics (SOS) in a novel way, avoiding their respective limitations and allowing succinct semantic definitions. The fact that a rewrite logic theory’s axioms include both equations and rewrite rules provides a useful “abstraction dial” to find the right balan...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003